Aqre Minimize
#パズル研究 #Aqre #最適化 #研究 #理論
Minimizing the number of black cells in Aqre
Use "Sugar" CSP solver for proof.
http://bach.istc.kobe-u.ac.jp/sugar/
csp generate code is here: https://ideone.com/EWZZXN
table: aqre number
1*1 0
2*2 0
3*3 0
4*4 7
5*5 9
6*6 13
7*7 15
8*8 27
9*9 33
10*10 41
11*11 47
12*12 〜61
6*6
13 (Proved)
https://gyazo.com/6ba1059208dc0c99bcefbe55f5f046c4
7*7
15 (Proved)
https://gyazo.com/500b37edbaa74eb77e858192df47e732
Only this and this rotation.
8*8
27 (Proved)
https://gyazo.com/ee378c8aeb3c793f477101c970244b11https://gyazo.com/d841188cade437bf3b350a98b12dea66
9*9
33 (Proved by semiexp)
https://gyazo.com/bdbef10c5588e0d1f656a1f485586792
10*10
43 (Not Proved)
https://gyazo.com/91a3a27419c826b9f97cae903000776f
41 (semiexp)
https://twitter.com/semiexp/status/1325763616230961153
※ Remove the black cells in R1C6.
40 doesn't exist.
https://twitter.com/semiexp/status/1325766654840590336
11*11
47 (Proved by semiexp)
https://gyazo.com/ab27a7363c68eb8980767a74ec4b2177
46 doesn't exist
https://twitter.com/semiexp/status/1326141404880404483
12*12
61 semiexp
https://twitter.com/semiexp/status/1325773048578887680
※ Remove the black cells in R1C3.
n*m
n -> ∞
〜2/5
https://twitter.com/utime1204/status/1322701633826873345
$ \frac{2}{5}nm+O(n+m)
(proved)